An Optimization Strategy Based on the Maximization of Matching-Targets’ Probability for Unevaluated Results
نویسنده
چکیده
An Optimization Strategy Based on the Maximization of Matching-Targets’ Probability for Unevaluated Results— TheMaximization ofMatching-Targets’ Probability forUnevaluated Results (MMTPUR), technique presented in this paper, is based on the classical probabilistic optimization framework. The numerical function values that have not been evaluated are considered as stochastic functions. Thus, a Gaussian process uncertainty model is built for each required numerical function result (i.e., associated with each specified target) and is used to estimate probability density functions for unevaluated results. Parameter posterior distributions, used within the optimization process, then take into account these probabilities. This approach is particularly adapted when, getting one evaluation of the numerical function is very time consuming. In this paper, we provide a detailed outline of this technique. Finally, several test cases are developed to stress its potential. Oil & Gas Science and Technology – Rev. IFP Energies nouvelles, Vol. 68 (2013), No. 3, pp. 545-556 Copyright 2013, IFP Energies nouvelles DOI: 10.2516/ogst/2012079
منابع مشابه
Using and comparing metaheuristic algorithms for optimizing bidding strategy viewpoint of profit maximization of generators
With the formation of the competitive electricity markets in the world, optimization of bidding strategies has become one of the main discussions in studies related to market designing. Market design is challenged by multiple objectives that need to be satisfied. The solution of those multi-objective problems is searched often over the combined strategy space, and thus requires the simultaneous...
متن کاملA Novel Technique for Steganography Method Based on Improved Genetic Algorithm Optimization in Spatial Domain
This paper devotes itself to the study of secret message delivery using cover image and introduces a novel steganographic technique based on genetic algorithm to find a near-optimum structure for the pair-wise least-significant-bit (LSB) matching scheme. A survey of the related literatures shows that the LSB matching method developed by Mielikainen, employs a binary function to reduce the numbe...
متن کاملOptimal Observer Path Planning For Bearings-Only Moving Targets Tracking Using Chebyshev Polynomials
In this paper, an optimization problem for the observer trajectory in the bearings-only surface moving target tracking (BOT) is studied. The BOT depends directly on the observability of the target's position in the target/observer geometry or the optimal observer maneuver. Therefore, the maximum lower band of the Fisher information matrix is opted as an independent criterion of the target estim...
متن کاملNonlinear Trading Models Through Sharpe Ratio Maximization
While many trading strategies are based on price prediction, traders in financial markets are typically interested in optimizing risk-adjusted performance such as the Sharpe Ratio, rather than the price predictions themselves. This paper introduces an approach which generates a nonlinear strategy that explicitly maximizes the Sharpe Ratio. It is expressed as a neural network model whose output ...
متن کاملElite Opposition-based Artificial Bee Colony Algorithm for Global Optimization
Numerous problems in engineering and science can be converted into optimization problems. Artificial bee colony (ABC) algorithm is a newly developed stochastic optimization algorithm and has been widely used in many areas. However, due to the stochastic characteristics of its solution search equation, the traditional ABC algorithm often suffers from poor exploitation. Aiming at this weakness o...
متن کامل